0.02/0.09 % Problem : Vampire---4.8_2418 : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : run_E %s %d THM 0.09/0.30 % Computer : n020.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 1440 0.09/0.30 % WCLimit : 180 0.09/0.30 % DateTime : Mon Jul 3 12:44:17 EDT 2023 0.09/0.30 % CPUTime : 0.15/0.40 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.XytkAPQyJt/Vampire---4.8_2418 0.15/0.40 # Version: 3.1pre001-ho 41.59/5.67 # Preprocessing class: HSMSSMSSSSSNHHA. 41.59/5.67 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 41.59/5.67 # Starting full_lambda_6 with 540s (3) cores 41.59/5.67 # Starting post_as_ho1 with 180s (1) cores 41.59/5.67 # Starting lpo6_lambda_fix with 180s (1) cores 41.59/5.67 # Starting ho_unfolding_1 with 180s (1) cores 41.59/5.67 # Starting new_ho_10_unif with 180s (1) cores 41.59/5.67 # Starting ho_unfolding_2 with 180s (1) cores 41.59/5.67 # post_as_ho1 with pid 2598 completed with status 0 41.59/5.67 # Result found by post_as_ho1 41.59/5.67 # Preprocessing class: HSMSSMSSSSSNHHA. 41.59/5.67 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 41.59/5.67 # Starting full_lambda_6 with 540s (3) cores 41.59/5.67 # Starting post_as_ho1 with 180s (1) cores 41.59/5.67 # No SInE strategy applied 41.59/5.67 # Search class: HGHNF-FFSF22-SHHFFSBN 41.59/5.67 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 41.59/5.67 # Starting new_ho_10_unif with 54s (1) cores 41.59/5.67 # new_ho_10_unif with pid 2604 completed with status 0 41.59/5.67 # Result found by new_ho_10_unif 41.59/5.67 # Preprocessing class: HSMSSMSSSSSNHHA. 41.59/5.67 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 41.59/5.67 # Starting full_lambda_6 with 540s (3) cores 41.59/5.67 # Starting post_as_ho1 with 180s (1) cores 41.59/5.67 # No SInE strategy applied 41.59/5.67 # Search class: HGHNF-FFSF22-SHHFFSBN 41.59/5.67 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 41.59/5.67 # Starting new_ho_10_unif with 54s (1) cores 41.59/5.67 # Preprocessing time : 0.001 s 41.59/5.67 # Presaturation interreduction done 41.59/5.67 41.59/5.67 # Proof found! 41.59/5.67 # SZS status Theorem 41.59/5.67 # SZS output start CNFRefutation 41.59/5.67 thf(decl_22, type, epred1_0: a > a > $o). 41.59/5.67 thf(decl_23, type, esk1_0: (a > $o) > a). 41.59/5.67 thf(decl_24, type, esk2_2: (a > $o) > a > a). 41.59/5.67 thf(decl_25, type, esk3_0: a > a). 41.59/5.67 thf(cTHM145_B_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X5))=>(X1 @ X3 @ X5)))&![X6:a > $o]:(((![X5:a]:(((X6 @ X5)=>(X1 @ X5 @ (X2 @ X6))))&![X5:a]:(((X1 @ X5 @ (X2 @ X6))<=(X6 @ X5))))&![X7:a]:((![X8:a]:(((X6 @ X8)=>(X1 @ X8 @ X7)))=>(X1 @ (X2 @ X6) @ X7))))))=>![X9:a > a]:((?[X10:a]:(((X1 @ X10 @ (X9 @ X10))&(X1 @ (X9 @ X10) @ X10)))<=(![X3:a, X4:a]:(((X1 @ (X9 @ X3) @ (X9 @ X4))<=(X1 @ X3 @ X4)))&![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4))))))))), file('/export/starexec/sandbox/tmp/tmp.XytkAPQyJt/Vampire---4.8_2418', cTHM145_B_pme)). 41.59/5.67 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a, X4:a, X5:a]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X5))=>(X1 @ X3 @ X5)))&![X6:a > $o]:((![X5:a]:(((X6 @ X5)=>(X1 @ X5 @ (X2 @ X6))))&![X7:a]:((![X8:a]:(((X6 @ X8)=>(X1 @ X8 @ X7)))=>(X1 @ (X2 @ X6) @ X7))))))=>![X9:a > a]:((![X3:a, X4:a]:(((X1 @ X3 @ X4)=>(X1 @ (X9 @ X3) @ (X9 @ X4))))=>?[X10:a]:(((X1 @ X10 @ (X9 @ X10))&(X1 @ (X9 @ X10) @ X10)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_B_pme])])). 41.59/5.67 thf(c_0_2, negated_conjecture, ![X29:a, X30:a, X31:a, X32:a > $o, X33:a, X34:a, X37:a, X38:a, X39:a]:((((~(epred1_0 @ X29 @ X30)|~(epred1_0 @ X30 @ X31)|(epred1_0 @ X29 @ X31))&((~(X32 @ X33)|(epred1_0 @ X33 @ (esk1_0 @ X32)))&(((X32 @ (esk2_2 @ X32 @ X34))|(epred1_0 @ (esk1_0 @ X32) @ X34))&(~(epred1_0 @ (esk2_2 @ X32 @ X34) @ X34)|(epred1_0 @ (esk1_0 @ X32) @ X34)))))&((~(epred1_0 @ X37 @ X38)|(epred1_0 @ (esk3_0 @ X37) @ (esk3_0 @ X38)))&(~(epred1_0 @ X39 @ (esk3_0 @ X39))|~(epred1_0 @ (esk3_0 @ X39) @ X39))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 41.59/5.67 thf(c_0_3, negated_conjecture, ![X3:a, X4:a, X5:a]:(((epred1_0 @ X3 @ X5)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.59/5.67 thf(c_0_4, negated_conjecture, ![X3:a, X4:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk3_0 @ X4))|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.59/5.67 thf(c_0_5, negated_conjecture, ![X3:a, X5:a, X4:a]:(((epred1_0 @ X3 @ (esk3_0 @ X4))|~((epred1_0 @ X3 @ (esk3_0 @ X5)))|~((epred1_0 @ X5 @ X4)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 41.59/5.67 thf(c_0_6, negated_conjecture, ![X6:a > $o, X3:a]:(((X6 @ (esk2_2 @ X6 @ X3))|(epred1_0 @ (esk1_0 @ X6) @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.59/5.67 thf(c_0_7, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ X3 @ (esk1_0 @ X6))|~((X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.59/5.67 thf(c_0_8, negated_conjecture, ![X3:a, X21:a > a, X9:a > a, X4:a]:(((epred1_0 @ (X9 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0))))) @ X3)) @ (esk3_0 @ X4))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0)))))) @ X3)|~((epred1_0 @ (X21 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0))))) @ X3)) @ X4)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 41.59/5.67 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X3))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 41.59/5.67 thf(c_0_10, negated_conjecture, ![X6:a > $o, X3:a]:(((epred1_0 @ (esk1_0 @ X6) @ X3)|~((epred1_0 @ (esk2_2 @ X6 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.59/5.67 thf(c_0_11, negated_conjecture, ![X3:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X3) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 41.59/5.67 thf(c_0_12, negated_conjecture, ![X9:a > a, X3:a]:(((epred1_0 @ (esk3_0 @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X9 @ Z0)))))))|~((epred1_0 @ X3 @ (X9 @ (esk3_0 @ X3)))))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 41.59/5.67 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 41.59/5.67 thf(c_0_14, negated_conjecture, ![X3:a]:((~((epred1_0 @ X3 @ (esk3_0 @ X3)))|~((epred1_0 @ (esk3_0 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.59/5.67 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 41.59/5.67 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 41.59/5.67 # SZS output end CNFRefutation 41.59/5.67 # Parsed axioms : 2 41.59/5.67 # Removed by relevancy pruning/SinE : 0 41.59/5.67 # Initial clauses : 7 41.59/5.67 # Removed in clause preprocessing : 1 41.59/5.67 # Initial clauses in saturation : 6 41.59/5.67 # Processed clauses : 865 41.59/5.67 # ...of these trivial : 128 41.59/5.67 # ...subsumed : 272 41.59/5.67 # ...remaining for further processing : 465 41.59/5.67 # Other redundant clauses eliminated : 0 41.59/5.67 # Clauses deleted for lack of memory : 0 41.59/5.67 # Backward-subsumed : 29 41.59/5.67 # Backward-rewritten : 47 41.59/5.67 # Generated clauses : 48582 41.59/5.67 # ...of the previous two non-redundant : 41702 41.59/5.67 # ...aggressively subsumed : 0 41.59/5.67 # Contextual simplify-reflections : 0 41.59/5.67 # Paramodulations : 48398 41.59/5.67 # Factorizations : 183 41.59/5.67 # NegExts : 0 41.59/5.67 # Equation resolutions : 1 41.59/5.67 # Total rewrite steps : 7285 41.59/5.67 # Propositional unsat checks : 0 41.59/5.67 # Propositional check models : 0 41.59/5.67 # Propositional check unsatisfiable : 0 41.59/5.67 # Propositional clauses : 0 41.59/5.67 # Propositional clauses after purity: 0 41.59/5.67 # Propositional unsat core size : 0 41.59/5.67 # Propositional preprocessing time : 0.000 41.59/5.67 # Propositional encoding time : 0.000 41.59/5.67 # Propositional solver time : 0.000 41.59/5.67 # Success case prop preproc time : 0.000 41.59/5.67 # Success case prop encoding time : 0.000 41.59/5.67 # Success case prop solver time : 0.000 41.59/5.67 # Current number of processed clauses : 383 41.59/5.67 # Positive orientable unit clauses : 92 41.59/5.67 # Positive unorientable unit clauses: 0 41.59/5.67 # Negative unit clauses : 15 41.59/5.67 # Non-unit-clauses : 276 41.59/5.67 # Current number of unprocessed clauses: 40344 41.59/5.67 # ...number of literals in the above : 125906 41.59/5.67 # Current number of archived formulas : 0 41.59/5.67 # Current number of archived clauses : 82 41.59/5.67 # Clause-clause subsumption calls (NU) : 11964 41.59/5.67 # Rec. Clause-clause subsumption calls : 10030 41.59/5.67 # Non-unit clause-clause subsumptions : 293 41.59/5.67 # Unit Clause-clause subsumption calls : 2672 41.59/5.67 # Rewrite failures with RHS unbound : 0 41.59/5.67 # BW rewrite match attempts : 2202 41.59/5.67 # BW rewrite match successes : 57 41.59/5.67 # Condensation attempts : 865 41.59/5.67 # Condensation successes : 9 41.59/5.67 # Termbank termtop insertions : 12462451 41.59/5.67 41.59/5.67 # ------------------------------------------------- 41.59/5.67 # User time : 5.106 s 41.59/5.67 # System time : 0.165 s 41.59/5.67 # Total time : 5.271 s 41.59/5.67 # Maximum resident set size: 1712 pages 42.59/5.78 42.59/5.78 # ------------------------------------------------- 42.59/5.78 # User time : 5.106 s 42.59/5.78 # System time : 0.168 s 42.59/5.78 # Total time : 5.274 s 42.59/5.78 # Maximum resident set size: 1732 pages 42.59/5.78 % E---3.1 exiting 42.59/5.78 EOF